Run-Time Management of Dynamically Recon gurable Designs

نویسنده

  • N. Shirazi
چکیده

A method for managing recon gurable designs, which supports run-time con guration transformation, is proposed. This method involves structuring the recon guration manager into three components: a monitor, a loader, and a con guration store. Di erent trade-o s can be achieved in con guration time, optimality of the con gured circuits, and the complexity of the recon guration manager, depending on the reconguration methods and the amount of run-time information available at compile time. The proposed techniques, implementable in hardware or software, are supported by our tools and can be applied to both partially and non-partially recon gurable devices. We describe the combined and the partitioned recon guration methods, and use them to illustrate the techniques and the associated trade-o s.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Erlangen Slot Machine - An FPGA-Based Partially Reconfigurable Computer

Partial recon guration is a special case of device con guration that allows to change only parts of a hardware circuit at run-time. Only a prede ned region of an FPGA is updated while the remainder of the device continues to operate undisturbed. This is especially valuable when a device operates in a missioncritical environment and cannot be disrupted while a subsystem is rede ned for performan...

متن کامل

Dynamic Precision Management for Loop Computations on Recon gurable Architectures

Recon gurable architectures promise signi cant performance bene ts by customizing the con gurations to suit the computations. Variable precision for computations is one important method of customization for which recon gurable architectures are well suited. The precision of the operations can be modi ed dynamically at run-time to match the precision of the operands. Though the advantages of rec...

متن کامل

Synthesizing Recon gurable Sequential Machines Using Tabular Models

Two common problems we face in implementing recon gurable systems on currently available FPGA chips are: (1) tting designs which are too big for available hardware resources on a single FPGA chip, (2) lack of synthesis tools for high-level speci cations. One solution to address the rst problem is partial recon guration or run-time recon guration which requires only loading a portion of the desi...

متن کامل

Automating Production of Run-Time Recon gurable Designs

This paper describes a method that automates a key step in producing run-time recon gurable designs: the identi cation and mapping of recongurable regions. In this method, two successive circuit con gurations are matched to locate the components common to them, so that recon guration time can be minimized. The circuit congurations are represented as a weighted bipartite graph, to which an e cie...

متن کامل

Object oriented development method for recon®gurable embedded systems

The authors present a novel method for developing recon®gurable systems targeted at embedded system applications. The paper shows how an existing object oriented design method (MOOSE) has been adapted to include recon®gurable hardware (FPGAs). Previous research on recon®gurable computing has concentrated on the ef®cient mapping of algorithms to FPGAs. It must be realised that recon®gurable hard...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000